Belief Revision on Computation Tree Logic
نویسندگان
چکیده
Model checking is one of the most effective techniques in automated system verification. Although this technique can handle complex verifications, model checking tools usually do not give any suggestions on how to repair inconsistent system models. In this paper, we show that approaches developed to update models of Computation Tree Logic (CTL) cannot deal with all kinds of changes. We introduce the concept of CTL model revision: an approach based on belief revision to handle system inconsistency in a static context.
منابع مشابه
Handling Inconsistencies in CTL Model-Checking using Belief Revision
Given a formal description of a system, there are computational tools that verify the validity of some properties in the system. These tools usually only tell the user whether the property holds or not, without giving any hint as to how the system could be adapted in order for the desired property to hold. In this paper, we present a formal approach for handling inconsistencies in CTL (computat...
متن کاملA System for Computing Constrained Default Logic Extensions
The aim of this paper is to describe the algorithmic foundations of the part of the program Exten responsible for the computation of extensions in Constrained Default Logic. Exten is a system that computes extensions for various default logics. The eeciency of the system is increased by pruning techniques for the search tree. We motivate and present these techniques, and demonstrate that they c...
متن کاملHow has belief modality contributed to formal semantics?
Looking back the history of formal treatment of linguistics, we cannot disregard the contribution of possible world semantics. Intensional logic of Montague semantics, DRT (Discourse Representation Theory), mental space, and situation theory are closely related to or compared with the notion of possible world. All these theories have commonly clarified the structure of belief context or uncerta...
متن کاملREVISE: An Extended Logic Programming System for Revising Knowledge Bases
In this paper we describe REVISE, an extended logic programming system for revising knowledge bases. REVISE is based on logic programming with explicit negation, plus a two-valued assumption revision to face contradiction , encompasses the notion of preference levels. Its reliance on logic programming allows efficient computation and declarativity, whilst its use of explicit negation, revision ...
متن کاملBelief Revision, Conditional Logic and Nonmonotonic Reasoning
We consider the connections between belief revision, conditional logic and nonmonotonic reasoning, using as a foundation the approach to theory change developed by Alchourrón, Gärdenfors and Makinson (the AGM approach). This is first generalized to allow the iteration of theory change operations to capture the dynamics of epistemic states according to a principle of minimal change of entrenchme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011